A Note on Coradical of Consistent Subset of Σ-reflexive Semigroups with Apartness
نویسندگان
چکیده
The concept of σ-reflexive semigroups is due to Chacron and Thierrin in 1972. In the present paper we discuss σ-reflexive semigroups with apartness. We prove some fundamental properties of these semigroups.
منابع مشابه
An Introduction to Implicative Semigroups with Apartness
The setting of this research is Bishop’s constructive mathematics. Following ideas of Chan and Shum, exposed in their famous paper “Homomorphisms of implicative semigroups”, we discuss the structure of implicative semigroups on sets with tight apartness. Moreover, we use anti-orders instead of partial orders. We study concomitant issues induced by existence of apartness and anti-orders giving s...
متن کاملTRANSFORMATION SEMIGROUPS AND TRANSFORMED DIMENSIONS
In the transformation semigroup (X, S) we introduce the height of a closed nonempty invariant subset of X, define the transformed dimension of nonempty subset S of X and obtain some results and relations.
متن کاملA Complete Quasi-antiorder Is the Intersection of a Collection of Quasi-antiorders
Setting of this paper is Bishop's constructive mathematics. For a relation σ on a set with apartness is called quasi-antiorder if it is consistent and cotransitive. The quasi-antiorder σ is complete if holds . 0 1 / = σ σ − ∩ In this paper the following assertion ‘A quasi-antiorder is the intersection of a collection of quasi-antiorders.’ is given.
متن کاملFREE SEMIGROUPS AND IDEMPOTENTS IN T
The known theory for an oid T shows how to find a subset T of ?T, which is a compact right topological semigroup [I]. The success of the methods in [2] for obtaining properties of-T has prompted us to see how successful they would be in another context. Thus we find (Theorem 4.8) that T cont ains copies of free semigroups on 2? generators, is an immediate consequence of the stronger resu...
متن کاملIterative algorithm for the generalized $(P,Q)$-reflexive solution of a quaternion matrix equation with $j$-conjugate of the unknowns
In the present paper, we propose an iterative algorithm for solving the generalized $(P,Q)$-reflexive solution of the quaternion matrix equation $overset{u}{underset{l=1}{sum}}A_{l}XB_{l}+overset{v} {underset{s=1}{sum}}C_{s}widetilde{X}D_{s}=F$. By this iterative algorithm, the solvability of the problem can be determined automatically. When the matrix equation is consistent over...
متن کامل